Rotated Library Sort
نویسندگان
چکیده
This paper investigates how to improve the worst case runtime of INSERTION SORT while keeping it in-place, incremental and adaptive. To sort an array of n elements with w bits for each element, classic INSERTION SORT runs in O(n) operations with wn bits space. GAPPED INSERTION SORT has a runtime of O(n lg n) with a high probability of only using (1+ )wn bits space. This paper shows that ROTATED INSERTION SORT guarantees O( √ n lg n) operations per insertion and has a worst case sorting time of O(n lg n) operations by using optimal O(w) auxiliary bits. By using extra Θ( √ n lg n) bits and recursively applying the same structure l times, it can be done with O(2n 1 l ) operations. Apart from the space usage and time guarantees, it also has the advantage of efficiently retrieving the i-th element in constant time. This paper presents ROTATED LIBRARY SORT that combines the advantages of the above two improved approaches.
منابع مشابه
Rotated Kanji Character Recognition
We proposed a rotated character recognition method using eigen-subspace characterized multiple projection and simple projection. Then the multiple projections showed a higher accuracy at low dimensions than a simple projection for alphanumeric 62 categories. This time, we applied it for the first class of Japanese Industrial Standard (JIS) Kanji set which includes 2,965 categories. As the resul...
متن کاملSymmetry Partition Sort
In this paper, we propose a useful replacement for quicksort-style utility functions. The replacement is called Symmetry Partition Sort, which has essentially the same principle as Proportion Extend Sort. The maximal difference between them is that the new algorithm always places already partially sorted inputs (used as a basis for the proportional extension) on both ends when entering the part...
متن کاملA Coq Library for Internal Verification of Running-Times
This paper presents a Coq library that lifts an abstract yet precise notion of running-time into the type of a function. Our library is based on a monad that counts abstract steps, controlled by one of the monadic operations. The monad’s computational content, however, is simply that of the identity monad so programs written in our monad (that recur on the natural structure of their arguments) ...
متن کاملNeocognitron for rotated pattern recognition
Ideally computer pattern recognition systems should be insensitive to scaling, translation, distortion and rotation. Many neural network models have been proposed to address this purpose. The Neocognitron is a multi-layered neural network model for pattern recognition introduced by Fukushima in the early 1980s. It was considered effective and, after supervised learning, it can recognise input p...
متن کاملSUNY Stony Brook bender
Traditional INSERTION SORT runs in O(n) time because each insertion takes O(n) time. When people run INSERTION SORT in the physical world, they leave gaps between items to accelerate insertions. Gaps help in computers as well. This paper shows that GAPPED INSERTION SORT has insertion times of O(logn) with high probability, yielding a total running time of O(n logn) with high probability.
متن کامل